Inclusion of Higher Order Terms for Small-Signal (Modal) Analysis: Committee Report—Task Force on Assessing the Need to Include Higher Order Terms for Small-Signal (Modal) Analysis
نویسندگان
چکیده
منابع مشابه
Higher-Order Annotated Terms for Proof Search
A notion of embedding appropriate to higher-order syntax is described. This provides a representation of annotated formulae in terms of the diierence between pairs of formulae. We deene substitution and uniication for such annotated terms. Using this representation of annotated terms, the proof search guidance technique of rippling can be extended to higher-order theorems. We illustrate this by...
متن کاملTopos Semantics for Higher-Order Modal Logic
We define the notion of a model of higher-order modal logic in an arbitrary elementary topos E . In contrast to the wellknown interpretation of (non-modal) higher-order logic, the type of propositions is not interpreted by the subobject classifier ΩE , but rather by a suitable complete Heyting algebra H . The canonical map relating H and ΩE both serves to interpret equality and provides a modal...
متن کاملModal Higher-order Logic for Agents
This paper introduces a modal higher-order logic for representing belief states of agents. The syntax and semantics of the logic and a tableau system for proving theorems are presented and an indication given as to how the logic can be used for building multi-agent systems. The main ideas are illustrated by an extended example concerning a user agent for the Internet.
متن کاملBounded Higher-order Unification using Regular Terms
We present a procedure for the bounded unification of higher-order terms [24]. The procedure extends G. P. Huet’s pre-unification procedure [11] with rules for the generation and folding of regular terms. The concise form of the procedure allows the reuse of the pre-unification correctness proof. Furthermore, the regular terms can be restricted in order to get a decidable unifiability problem. ...
متن کاملHigher-Order Modal Logic - A Sketch
First-order modal logic, in the usual formulations, is not sufficiently expressive, and as a consequence problems like Frege’s morning star/evening star puzzle arise. The introduction of predicate abstraction machinery provides a natural extension in which such difficulties can be addressed. But this machinery can also be thought of as part of a move to a full higher-order modal logic. In this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Power Systems
سال: 2005
ISSN: 0885-8950
DOI: 10.1109/tpwrs.2005.858029